class Solution1 {
    public int[] searchRange(int[] nums, int target) {
        int[] ret = {-1,-1};
        if(nums.length == 0 || nums == null) {
            return ret;
        }
        int left = 0,right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left) / 2;
            if(nums[mid] < target) {
                left = mid + 1;
            }else {
                right = mid;
            }
        }
        if(nums[left] == target) {
            ret[0] = left;
        }
        left = 0;right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left + 1) / 2;
            if(nums[mid] <= target) {
                left = mid;
            }else {
                right = mid - 1;
            }
        }
        if(nums[left] == target) {
            ret[1] = left;
        }
        return ret;
    }
}